Improved Majority Identification by the Coarsened Majority Automaton

The initial majority identification task is a fundamental test problem in cellular automaton research. To pass the test, two-state has to attain uniform configuration consisting of only state that was initially majority. It does so solely through its local, internal dynamics—i.e., success an example emergent computation. Finding new, better-performing automata continues be interest for what additional clues they might reveal about this form Here we describe novel, coarsened version one standard identifiers. We show system outperforms parent while significantly reducing number computations required accomplish task.